-
1 старши бит
изч.most-significant bitизч.most-significant bits -
2 старший бит
Русско-английский словарь по информационным технологиям > старший бит
-
3 Shannon, Claude Elwood
[br]b. 30 April 1916 Gaylord, Michigan, USA[br]American mathematician, creator of information theory.[br]As a child, Shannon tinkered with radio kits and enjoyed solving puzzles, particularly crypto-graphic ones. He graduated from the University of Michigan in 1936 with a Bachelor of Science in mathematics and electrical engineering, and earned his Master's degree from the Massachusetts Institute of Technology (MIT) in 1937. His thesis on applying Boolean algebra to switching circuits has since been acclaimed as possibly the most significant this century. Shannon earned his PhD in mathematics from MIT in 1940 with a dissertation on the mathematics of genetic transmission.Shannon spent a year at the Institute for Advanced Study in Princeton, then in 1941 joined Bell Telephone Laboratories, where he began studying the relative efficiency of alternative transmission systems. Work on digital encryption systems during the Second World War led him to think that just as ciphers hide information from the enemy, "encoding" information could also protect it from noise. About 1948, he decided that the amount of information was best expressed quantitatively in a two-value number system, using only the digits 0 and 1. John Tukey, a Princeton colleague, named these units "binary digits" (or, for short, "bits"). Almost all digital computers and communications systems use such on-off, or two-state logic as their basis of operation.Also in the 1940s, building on the work of H. Nyquist and R.V.L. Hartley, Shannon proved that there was an upper limit to the amount of information that could be transmitted through a communications channel in a unit of time, which could be approached but never reached because real transmissions are subject to interference (noise). This was the beginning of information theory, which has been used by others in attempts to quantify many sciences and technologies, as well as subjects in the humanities, but with mixed results. Before 1970, when integrated circuits were developed, Shannon's theory was not the preferred circuit-and-transmission design tool it has since become.Shannon was also a pioneer in the field of artificial intelligence, claiming that computing machines could be used to manipulate symbols as well as do calculations. His 1953 paper on computers and automata proposed that digital computers were capable of tasks then thought exclusively the province of living organisms. In 1956 he left Bell Laboratories to join the MIT faculty as Professor of Communications Science.On the lighter side, Shannon has built many devices that play games, and in particular has made a scientific study of juggling.[br]Principal Honours and DistinctionsNational Medal of Science. Institute of Electrical and Electronics Engineers Medal of Honor, Kyoto Prize.BibliographyHis seminal paper (on what has subsequently become known as information theory) was entitled "The mathematical theory of communications", first published in Bell System Technical Journal in 1948; it is also available in a monograph (written with Warren Weaver) published by the University of Illinois Press in 1949, and in Key Papers in the Development of Information Theory, ed. David Slepian, IEEE Press, 1974, 1988. For readers who want all of Shannon's works, see N.J.A.Sloane and A.D.Wyner, 1992, TheCollected Papers of Claude E.Shannon.HO
См. также в других словарях:
Most significant bit — In computing, the most significant bit (msb, also called the high order bit) is the bit position in a binary number having the greatest value. The msb is sometimes referred to as the left most bit due to the convention in positional notation of… … Wikipedia
Most Significant Bit — Die Bitwertigkeit bezeichnet den Stellenwert eines einzelnen Bits, den es durch seine Position innerhalb einer Binärzahl (meist Dualzahl) hat. Inhaltsverzeichnis 1 MSB 2 LSB 3 Byte Reihenfolge 4 Zahlenformat und Vorzeichenbit … Deutsch Wikipedia
Least significant bit — In computing, the least significant bit (lsb) is the bit position in a binary integer giving the units value, that is, determining whether the number is even or odd. The lsb is sometimes referred to as the right most bit, due to the convention in … Wikipedia
Least Significant Bit — Die Bitwertigkeit bezeichnet den Stellenwert eines einzelnen Bits, den es durch seine Position innerhalb einer Binärzahl (meist Dualzahl) hat. Inhaltsverzeichnis 1 MSB 2 LSB 3 Byte Reihenfolge 4 Zahlenformat und Vorzeichenbit … Deutsch Wikipedia
Least number bits — Least Number of Bits (LNB) is a database storage technology, which was first published in February 2001, as a type of database management system internals abstract. It consists of a method and system for determining the absolute least number of… … Wikipedia
CPU cache — Cache memory redirects here. For the general use, see cache. A CPU cache is a cache used by the central processing unit of a computer to reduce the average time to access memory. The cache is a smaller, faster memory which stores copies of the… … Wikipedia
INTERCAL — INTERCAL, a programming language parody, is the canonical esoteric programming language. It was created by Don Woods and James M. Lyon, two Princeton University students, in 1972. It satirizes aspects of the various programming languages at the… … Wikipedia
Subnetwork — Creating a subnet by dividing the host identifier A subnetwork, or subnet, is a logically visible subdivision of an IP network.[1] The practice of dividing a network into subnetworks is called subnetting. All computers that belong to a subnet are … Wikipedia
BMP file format — Windows Bitmap Filename extension .bmp or .dib Internet media type image/x ms bmp (unofficial) or image/x bmp (unofficial) Type code BMP BMPf BMPp Uniform Type Identifier com.microsoft.bmp … Wikipedia
Classful network — A classful network is a network addressing architecture used in the Internet from 1981 until the introduction of Classless Inter Domain Routing in 1993. The method divides the address space for Internet Protocol Version 4 (IPv4) into five address … Wikipedia
Two's complement — The two s complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2 N for an N bit two s complement).A two s complement system or two s complement arithmetic is a… … Wikipedia
